optimal gamble - traduzione in russo
Diclib.com
Dizionario ChatGPT
Inserisci una parola o una frase in qualsiasi lingua 👆
Lingua:

Traduzione e analisi delle parole tramite l'intelligenza artificiale ChatGPT

In questa pagina puoi ottenere un'analisi dettagliata di una parola o frase, prodotta utilizzando la migliore tecnologia di intelligenza artificiale fino ad oggi:

  • come viene usata la parola
  • frequenza di utilizzo
  • è usato più spesso nel discorso orale o scritto
  • opzioni di traduzione delle parole
  • esempi di utilizzo (varie frasi con traduzione)
  • etimologia

optimal gamble - traduzione in russo

CLASS OF MATHEMATICAL PROBLEMS CONCERNED WITH CHOOSING AN OPTIMAL TIME TO TAKE A PARTICULAR ACTION
Optimal Stopping; Optimal Stopping problem

optimal gamble      

математика

оптимальная игра

optimal stopping problem         
задача об оптимальной остановке
optimal experiment         
EXPERIMENTAL DESIGN THAT IS OPTIMAL WITH RESPECT TO SOME STATISTICAL CRITERION
Optimum design; Optimum experiment; Optimal experiment; Optimum experimental designs; Model-oriented design of experiments; Optimal Design of Experiments; Alphabetic optimality; Optimal design of experiments; Optimal design of experiment; Optimum design of experiments; Optimum design of experiment; Optimal experimental design; Optimum experimental design; Optimal experimental designs; D-optimal design; E-optimal design; Optimal design model selection

математика

оптимальный эксперимент

Definizione

Longitudinal Redundancy Check
<storage, communications> (LRC, Block Redundancy Check) An error checking method that generates a longitudinal parity byte from a specified string or block of bytes on a longitudinal track. The longitudinal parity byte is created by placing individual bytes of a string in a two-dimensional array and performing a Vertical Redundancy Check vertically and horizontally on the array, creating an extra byte. This is an improvement over the VRC because it will catch two errors in the individual characters of the string, beyond the odd errors. (2004-01-26)

Wikipedia

Optimal stopping

In mathematics, the theory of optimal stopping or early stopping is concerned with the problem of choosing a time to take a particular action, in order to maximise an expected reward or minimise an expected cost. Optimal stopping problems can be found in areas of statistics, economics, and mathematical finance (related to the pricing of American options). A key example of an optimal stopping problem is the secretary problem. Optimal stopping problems can often be written in the form of a Bellman equation, and are therefore often solved using dynamic programming.

Traduzione di &#39optimal gamble&#39 in Russo